Index sets in computable analysis
نویسندگان
چکیده
منابع مشابه
Index Sets of Computable Structures
The index set of a computable structure A is the set of indices for computable copies of A. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary finite structures, Q-vector spaces, Archimedean real closed ordered fields, reduced Abelian p-groups of length less than ω, and models of the original Ehrenfeucht theory. The index sets for...
متن کاملIndex sets for computable differential equations
dx = F (x, y) and the wave equation from the point of view of index sets. Index sets play an important role in the study of computable functions and computably enumerable sets (see, for example, Soare [21]) . Index sets for computable combinatorics have been studied by Gasarch and others [8, 9]; the latter paper provides a survey of such results. Index sets for Π1 classes were developed by the ...
متن کاملIndex Sets of some Computable Groups
1 Acknowledgements I would first like to thank my advisor Professor Karen Lange. She has quite literally taught me everything I know about computability. She has helped me develop as not only a math researcher, but also a writer and presenter. I would also like to thank NSF grant DMS-1100604 for funding summer research that was instrumental in helping me complete this thesis. I would also like ...
متن کاملNon-computable Julia sets
Polynomial Julia sets have emerged as the most studied examples of fractal sets generated by a dynamical system. Apart from the beautiful mathematics, one of the reasons for their popularity is the beauty of the computer-generated images of such sets. The algorithms used to draw these pictures vary; the most näıve work by iterating the center of a pixel to determine if it lies in the Julia set....
متن کاملOrder-Computable Sets
We give a straightforward computable-model-theoretic definition of a property of ∆2 sets, called order-computability. We then prove various results about these sets which suggest that, simple though the definition is, the property defies any characterization in pure computability theory. The most striking example is the construction of two computably isomorphic c.e. sets, one of which is order-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00286-2